Reaction Attacks on Public Key Cryptosystems Based on the Word Problem
نویسندگان
چکیده
منابع مشابه
Braid Group Cryptography
In the last decade, a number of public key cryptosystems based on combinatorial group theoretic problems in braid groups have been proposed. We survey these cryptosystems and some known attacks on them. This survey includes: Basic facts on braid groups and on the Garside normal form of its elements, some known algorithms for solving the word problem in the braid group, the major public-key cryp...
متن کاملBraid Group Cryptography Preliminary Draft
In the last decade, a number of public key cryptosystems based on combinatorial group theoretic problems in braid groups have been proposed. Our tutorial is aimed at presenting these cryptosystems and some known attacks on them. We start with some basic facts on braid groups and on the Garside normal form of its elements. We then present some known algorithms for solving the word problem in the...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملImprovements of the Attacks on Cryptosystems Based on Error-correcting Codes Improvements of the Attacks on Cryptosystems Based on Error-correcting Codes Improvements of the Attacks on Cryptosystems Based on Error-correcting Codes
Many public-key cryptosystems and identiication schemes based on error-correcting codes have been proposed as an alternative to the common cryptographic algorithms based on number theory. They rely on the NP-hardness of nding a xed-weight word in a coset of a linear binary code. We here improve the previous attacks on these systems; this notably enables us to reduce the work factor involved in ...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2002 شماره
صفحات -
تاریخ انتشار 2002